氙原子在铂表面散射的分子动力论方法

运用分子动力论方法研究气体分子 (Xe)在固壁表面 (Pt)的散射。在构造了合理的气体分子与固壁表面相互作用势模型之后 ,运用随机经典轨道方法求解气体分子及固壁原子的运动方程 ,得到气体分子运动轨迹及散射后的运动状态。结果表明 ,气体分子散射后的角度分布与Maxwellian模型存在较大差异 ,而速度基本服从半空间的Maxwellian分布。     

废气涡轮增压柴油机动态模型研究

研究了废气涡轮增压柴油机作为转速控制对象时的动态数学模型 ,并在此基础上建立了数字式电子调速器仿真系统 .     

一种基于Mellin变换的水声宽带相关模糊函数的快速算法

提出了一种基于Mellin 变换的快速算法,其特点是在给定的某一时刻得到不同尺度下的变换结果,算法的运算量与待分析的时延成正比,而在固定时刻下的运算量为两个2M点的FFT和一次2M点复数乘法(M为待分析的尺度的个数).该算法的优点是实时性好,且适合于水声信号领域尺度跨度小、尺度分析较细的特点,并给出了与直接法、CZT法的比较结果.     

空空导弹三维实时动态数字仿真

主要论述了某型空空导弹实现３维实时动态数字仿真的思路和方法,首先建立３维空战模型,然后通过一定的计算方法和编程技巧实现了数字仿真的实时性。在数字仿真实时性的基础上,实现了导弹攻击目标过程的３维动态图形显示。     

基于复杂网络的作战网络分析

分布式网络化作战是网络中心战的基础,而分布式作战网络的构建是网络化作战的重要前提。首先,运用复杂网络的相关参数分析了多种不同的网络,选择了BA非标度网络作为分布式作战网络的最优表现形式;其次,以BA非标度网络为基础提出了一个适合军事上动态鲁棒性分析的模型DCNCE;最后,仿真结果表明,在以网络效能值为测度的对比下,分布式作战网络在介数毁伤策略下更脆弱,为构建并改进现有的作战网络提供了理论依据。     

社会计算实验动态仿真引擎的研究与实现

应对新形势下非常规突发事件的严峻挑战是各国政府亟待解决的问题,综合人工社会-计算实验-平行执行的ACP方法,是解决非常规突发事件应急管理问题的有效方法.本文引入ACP方法,阐述构建高性能社会计算实验动态仿真引擎的作用;按照层次化模块化思想设计动态仿真引擎D-PARSE的体系结构,详细描述各组成部分的具体功能,并基于并行...     

Dynamic pricing under first order Markovian competition

We evaluate the effect of competition on prices, profits, and consumers' surplus in multiperiod, finite horizon, dynamic pricing settings. In our base model, a single myopic consumer visits two competing retailers, who offer identical goods, in a (first order Markovian) probabilistic fashion—if the posted price exceeds the consumer's valuation for the good, he returns to the same store in the following period with a certain probability. We find that even a small reduction in the return probability from one—which corresponds to the monopoly case at which prices decline linearly—is sufficient to revert the price decline from a linear into an exponential shape. Each retailer's profit is particularly sensitive to changes in his return probability when it is relatively high, and is maximized under complete loyalty behavior (i.e., return probability is one). On the other hand, consumer surplus is maximized under complete switching behavior (i.e., return probability is zero). In the presence of many similar consumers, the insights remain valid. We further focus on the extreme scenario where all consumers follow a complete switching behavior, to derive sharp bounds, and also consider the instance where, in this setting, myopic consumers are replaced with strategic consumers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于聚类算法的多无人机系统任务分配

针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Sea...     

Quantifying the performance effects of idle time utilization in multiserver systems

In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.